/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.sedona.core.rangeJudgement;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import org.apache.sedona.core.spatialOperator.SpatialPredicate;
import org.apache.spark.api.java.function.FlatMapFunction;
import org.locationtech.jts.geom.Geometry;
import org.locationtech.jts.index.SpatialIndex;

// TODO: Auto-generated Javadoc

public class RangeFilterUsingIndex<U extends Geometry, T extends Geometry> extends JudgementBase
    implements FlatMapFunction<Iterator<SpatialIndex>, T> {

  public RangeFilterUsingIndex(U queryWindow, SpatialPredicate spatialPredicate) {
    super(queryWindow, spatialPredicate);
  }

  public RangeFilterUsingIndex(
      U queryWindow, boolean considerBoundaryIntersection, boolean leftCoveredByRight) {
    super(queryWindow, considerBoundaryIntersection, leftCoveredByRight);
  }

  /**
   * Call.
   *
   * @param treeIndexes the tree indexes
   * @return the iterator
   * @throws Exception the exception
   */
  /* (non-Javadoc)
   * @see org.apache.spark.api.java.function.FlatMapFunction#call(java.lang.Object)
   */
  @Override
  public Iterator<T> call(Iterator<SpatialIndex> treeIndexes) throws Exception {
    assert treeIndexes.hasNext();
    SpatialIndex treeIndex = treeIndexes.next();
    List<T> results = new ArrayList<T>();
    List<T> tempResults = treeIndex.query(this.queryGeometry.getEnvelopeInternal());
    for (T tempResult : tempResults) {
      if (match(tempResult, queryGeometry)) {
        results.add(tempResult);
      }
    }
    return results.iterator();
  }
}
